منابع مشابه
Completely Connected Clustered Graphs
Planar drawings of clustered graphs are considered. We introduce the notion of completely connected clustered graphs, i.e. hierarchically clustered graphs that have the property that not only every cluster but also each complement of a cluster induces a connected subgraph. As a main result, we prove that a completely connected clustered graph is c-planar if and only if the underlying graph is p...
متن کاملSuccinct Representations of Separable Graphs
We consider the problem of highly space-efficient representation of separable graphs while supporting queries in constant time in the RAM with logarithmic word size. In particular, we show constanttime support for adjacency, degree and neighborhood queries. For any monotone class of separable graphs, the storage requirement of the representation is optimal to within lower order terms. Separable...
متن کاملOn embedding well-separable graphs
Call a simple graph H of order n well-separable, if by deleting a separator set of size o(n) the leftover will have components of size at most o(n). We prove, that bounded degree wellseparable spanning subgraphs are easy to embed: for every γ > 0 and positive integer ∆ there exists an n0 such that if n > n0, ∆(H) ≤ ∆ for a well-separable graph H of order n and δ(G) ≥ (1− 1 2(χ(H)−1) +γ)n for a ...
متن کاملNon-separable detachments of graphs
Let G = (V,E) be a graph and r : V → Z+. An r-detachment of G is a graph H obtained by ‘splitting’ each vertex v ∈ V into r(v) vertices, called the pieces of v in H. Every edge uv ∈ E corresponds to an edge of H connecting some piece of u to some piece of v. An r-degree specification for G is a function f on V , such that, for each vertex v ∈ V , f(v) is a partition of d(v) into r(v) positive i...
متن کاملNon-Separable and Planar Graphs.
Introduction. In this paper the structure of graphs is studied by purely combinatorial methods. The concepts of rank and nullity are fundamental. The first part is devoted to a general study of non-separable graphs. Conditions that a graph be non-separable are given ; the decomposition of a separable graph into its non-separable parts is studied; by means of theorems on circuits of graphs, a me...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1990
ISSN: 0166-218X
DOI: 10.1016/0166-218x(90)90131-u